Solution of the shortcut problem in graph algorithms 圖論中最短路徑問題的解法
Dual graph algorithm for the volume of the city road network 城市道路網(wǎng)容量的對偶圖算法
Using vb to realize computer ruler and its derived graph algorithm 實現(xiàn)電腦畫尺及其衍生圖形算法
Parallel graph algorithm . university of science and technology of china press , 1991 此外,本文還介紹了一些典型的并行應(yīng)用和使能技術(shù)。
The support vector machine composed by least sequence and directed acyclic graph algorithm has been used in paper currency identification , shows the advantages of capability in dealing with scared samples , nonlinear and high dimensions 將次序最小優(yōu)化改進算法和有向無環(huán)圖算法構(gòu)建的支持向量機用于貨幣識別,充分發(fā)抨了支持向量機解決小樣本、非線性和高維模式識別問題的優(yōu)點。
The compare is made between the one - versus - one , one - versus - rest and directed acyclic graph algorithm of presented support vector machine multi - class classification algorithms . the simulations show the advantage of directed acyclic graph algorithm over the others the identification rate 分析比較了現(xiàn)有支持向量機多值分類算法中的一對一、一對多和有向無環(huán)圖算法,分析表明有向無環(huán)圖相對于其它兩種算法,不僅速度快,而且識別率也較高。
Topics covered include : sorting ; search trees , heaps , and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing 課程主題包含了:排序、搜尋樹、堆積及雜湊;各個擊破法、動態(tài)規(guī)劃、攤提分析、圖論演算法、最短路徑、網(wǎng)路流量、計算幾何、數(shù)論演算法;多項式及矩陣的運算;快取及平行計算。
Topics covered include : sorting ; search trees , heaps , and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing 課程主題包含了:排序、搜尋樹、堆積及散列;各個擊破法、動態(tài)規(guī)劃、攤提分析、圖論算法、最短路徑、網(wǎng)絡(luò)流量、計算幾何、數(shù)論算法;多項式及矩陣的運算;高速緩存技術(shù)及并行運算。
Firstly , the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type . secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention . finally , the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward , this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically 首先,采用廣度優(yōu)先搜索算法查找電氣原理圖中的連通導(dǎo)線端點集,并根據(jù)不同類型的繼電元件對應(yīng)的cad圖塊結(jié)構(gòu)的不同,得到電氣原理圖中元件接線端子之間的連接關(guān)系;其次,根據(jù)二分圖匹配算法為電氣原理圖中繼電元件選擇合適的型號和規(guī)格,并采用人工干預(yù)和自動布置相結(jié)合的方法完成屏面布置圖的自動生成;最后,提出了完全無向圖中經(jīng)過每個頂點一次且僅一次的優(yōu)化路徑算法,利用該算法和經(jīng)過預(yù)處理的prim最小生成樹算法自動生成屏內(nèi)安裝接線圖和端子接線圖。
Topics covered include : randomized computation ; data structures ( hash tables , skip lists ) ; graph algorithms ( minimum spanning trees , shortest paths , minimum cuts ) ; geometric algorithms ( convex hulls , linear programming in fixed or arbitrary dimension ) ; approximate counting ; parallel algorithms ; online algorithms ; derandomization techniques ; and tools for probabilistic analysis of algorithms 主題包括?隨機計算、資料結(jié)構(gòu)(雜湊表、省略串列) 、圖論演算法(最小擴張樹,最短路徑,最少切割) 、幾何演算法(凸殼、在固定或任意維度的線性規(guī)劃) 、近似計數(shù)、平行演算法、線上演算法、消去隨機技術(shù),以及演算法的機率分析工具。